Triangularizing Quadratic Matrix Polynomials
نویسندگان
چکیده
We show that any regular quadratic matrix polynomial can be reduced to an upper triangular quadratic matrix polynomial over the complex numbers preserving the finite and infinite elementary divisors. We characterize the real quadratic matrix polynomials that are triangularizable over the real numbers and show that those that are not triangularizable are quasi-triangularizable with diagonal blocks of sizes 1 × 1 and 2 × 2. We also derive complex and real Schur-like theorems for linearizations of quadratic matrix polynomials with nonsingular leading coefficients. In particular, we show that for any monic linearization λI + A of an n × n quadratic matrix polynomial there exists a nonsingular matrix defined in terms of n orthonormal vectors that transforms A to a companion linearization of a (quasi-)triangular quadratic matrix polynomial. This provides the foundation for designing numerical algorithms for the reduction of quadratic matrix polynomials to upper (quasi-)triangular form.
منابع مشابه
Towards Computing a Gröbner Basis of a Polynomial Ideal over a Field by Using Matrix Triangularization
We give first results of our investigation of the connection between Gröbner bases computation and Gaussian elimination. We show that for every input set F of polynomials a matrix of shifts of those polynomials exists such that by triangularizing this matrix we obtain a Gröbner basis of F .
متن کاملThe Numerical Solution of Some Optimal Control Systems with Constant and Pantograph Delays via Bernstein Polynomials
In this paper, we present a numerical method based on Bernstein polynomials to solve optimal control systems with constant and pantograph delays. Constant or pantograph delays may appear in state-control or both. We derive delay operational matrix and pantograph operational matrix for Bernstein polynomials then, these are utilized to reduce the solution of optimal control with constant...
متن کاملReliable numerical methods for polynomial matrix triangularization
Numerical procedures are proposed for triangularizing polynomial matrices over the eld of polynomial fractions and over the ring of polynomials. They are based on two standard polynomial techniques: Sylvester matrices and interpolation. In contrast to other triangularization methods, the algorithms described in this paper only rely on well-worked numerically reliable tools. They can also be use...
متن کاملHermitian Quadratic Matrix Polynomials: Solvents and Inverse Problems
A monic quadratic Hermitian matrix polynomial L(λ) can be factorized into a product of two linear matrix polynomials, say L(λ) = (Iλ−S)(Iλ−A). For the inverse problem of finding a quadratic matrix polynomial with prescribed spectral data (eigenvalues and eigenvectors) it is natural to prescribe a right solvent A and then determine compatible left solvents S. This problem is explored in the pres...
متن کاملFast Operations on Linearized Polynomials and their Applications in Coding Theory
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial degree s, independent of the underlying field extension degree m. We show that our multiplication algorithm is faster than all known ones when s ≤ m. Using a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 34 شماره
صفحات -
تاریخ انتشار 2013